A New Solution to the Random Assignment Problem with Private Endowment
نویسنده
چکیده
This paper proposes a new mechanism to solve random assignment problems in which some agents have private endowments. The new mechanism generalizes the Probabilistic Serial mechanism by letting agents benefit from the popularity of their private endowments, which is summarized by the idea of “you request my house I get your speed”. Interestingly, the same idea can also be used to deal with indifferent preferences in Probabilistic Serial and our generalization. Our method is straightforward to understand and easy to implement compared with the previous method of solving maximum network flow problems in the literature.
منابع مشابه
A NEW APPROACH TO THE SOLUTION OF SENSITIVITY MINIMIZATION IN LINEAR STATE FEEDBACK CONTROL
In this paper, it is shown that by exploiting the explicit parametric state feedback solution, it is feasible to obtain the ultimate solution to minimum sensitivity problem. A numerical algorithm for construction of a robust state feedback in eigenvalue assignment problem for a controllable linear system is presented. By using a generalized parametric vector companion form, the problem of eigen...
متن کاملA new multi-objective model for berth allocation and quay crane assignment problem with speed optimization and air emission considerations (A case study of Rajaee Port in Iran)
Over the past two decades, maritime transportation and container traffic worldwide has experienced rapid and continuous growth. With the increase in maritime transportation volume, the issue of greenhouse gas (GHG) emission has become one of the new concerns for port managers. Port managers and government agencies for sustainable development of maritime transportation considered "green ports" t...
متن کاملA two Stage Heuristic Solution Approach for Resource Assignment during a Cell Formation Problem
Design of Cellular Manufacturing System involves four major decisions: Cell formation (CF), Group layout (GL), Group scheduling (Gs) and Resource assignment (RA). These problems should be regarded, concurrently, in order to obtain an optimal solution in a CM environment. In this paper a two stage heuristic procedure is proposed for CF and RA decisions problem. The solution approach contains a ...
متن کاملTwo Mathematical Models for Railway Crew Scheduling Problem
Railway crew scheduling problem is a substantial part of the railway transportation planning, which aims to find the optimal combination of the trip sequences (pairings), and assign them to the crew complements. In this problem, each trip must be covered by at least one pairing. The multiple-covered trips lead to impose useless transfers called “transitions”. In this study, a new ma...
متن کاملCompetitive Equilibrium in the Random Assignment Problem
This paper studies the problem of random assignment with fractional endowments. Fractional endowments complicate matters because the assignment has to make an agent weakly better off than his endowment. I first formulate an exchange economy that resembles the random assignment problem and prove the existence of competitive equilibrium in this economy. I then propose a pseudo-market mechanism fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016